2236. 判断根结点是否等于子结点之和

为保证权益，题目请参考 2236. 判断根结点是否等于子结点之和(From LeetCode).

解决方案1

CPP

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;


struct TreeNode {
	int val;
	TreeNode* left;
	TreeNode* right;
	TreeNode() : val(0), left(nullptr), right(nullptr) {}
	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
	TreeNode(int x, TreeNode* left, TreeNode* right) : val(x), left(left), right(right) {}
};

class Solution {
public:
	bool checkTree(TreeNode* root) {
		return root->val == (root->left->val + root->right->val);
	}
};

Python

# 2236. 判断根结点是否等于子结点之和
# https://leetcode.cn/problems/root-equals-sum-of-children/

from typing import Optional

# Definition for a binary tree node.


class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


class Solution:
    def checkTree(self, root: Optional[TreeNode]) -> bool:
        return root.val == root.left.val + root.right.val